6 found
Order:
  1.  37
    Undecidable properties of finite sets of equations.George F. McNulty - 1976 - Journal of Symbolic Logic 41 (3):589-604.
  2. Fragments of first order logic, I: Universal horn logic.George F. McNulty - 1977 - Journal of Symbolic Logic 42 (2):221-237.
  3.  33
    Alfred Tarski and undecidable theories.George F. McNulty - 1986 - Journal of Symbolic Logic 51 (4):890-898.
  4. The existence of finitely based lower covers for finitely based equational theories.Jaroslav Ježek & George F. McNulty - 1995 - Journal of Symbolic Logic 60 (4):1242-1250.
  5.  12
    Inherently nonfinitely based lattices.Ralph Freese, George F. McNulty & J. B. Nation - 2002 - Annals of Pure and Applied Logic 115 (1-3):175-193.
    We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class generated by L is locally finite and that L belongs to no locally finite finitely axiomatizable equational class. We also provide an example of a lattice which fails to be inherently nonfinitely based but whose equational theory is not finitely axiomatizable.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  6.  18
    Minimum bases for equational theories of groups and rings: the work of Alfred Tarski and Thomas Green.George F. McNulty - 2004 - Annals of Pure and Applied Logic 127 (1-3):131-153.
    Suppose that T is an equational theory of groups or of rings. If T is finitely axiomatizable, then there is a least number μ so that T can be axiomatized by μ equations. This μ can depend on the operation symbols that occur in T. In the 1960s, Tarski and Green completely determined the values of μ for arbitrary equational theories of groups and of rings. While Tarski and Green announced the results of their collaboration in 1970, the only fuller (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark